منابع مشابه
Segmentation of touching characters in printed document recognition
Abstraet--A new discrimination function is presented for segmenting touching characters based on both pixel and profile projections. A dynamic recursive segmentation algorithm is developed for effectively segmenting touching characters. Contextual information and spell checking are used to correct errors caused by incorrect recognition and segmentation. Based on 12 real documents, a maximum 99....
متن کاملPersian Printed Document Analysis and Page Segmentation
This paper presents, a hybrid method, low-resolution and high-resolution, for Persian page segmentation. In the low-resolution page segmentation, a pyramidal image structure is constructed for multiscale analysis and segments document image to a set of regions. By high-resolution page segmentation, by connected components analysis, each region is segmented to homogeneous regions and identifyi...
متن کاملSegmentation and Recognition of Printed Arabic Characters
Arabic characters differ significantly from other characters such as Latin and Chinese characters in that they are written cursively in both printed and handwritten forms and consist of 28 main characters. However most of their shapes change according to their position in the word. These shapes together with some other secondaries raise the number of classes to 120. Furthermore, some of these c...
متن کاملOn Segmentation of Touching Characters and Overlapping Lines in Degraded Printed Gurmukhi Script
Character segmentation plays a very important role in a text recognition system. The simple technique of using inter-character gap for segmentation is useful for fine printed documents, but this technique fails to give satisfactory results if the input text contains touching characters. In this paper, we have proposed two algorithms to segment touching characters, and one algorithm to segment o...
متن کاملSegmentation of touching and fused Devanagari characters
Devanagari script is a two dimensional composition of symbols. It is highly cumbersome to treat each composite character as a separate atomic symbol because such combinations are very large in number. This paper presents a two pass algorithm for the segmentation and decomposition of Devanagari composite characters/symbols into their constituent symbols. The proposed algorithm extensively uses s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 1994
ISSN: 0031-3203
DOI: 10.1016/0031-3203(94)90167-8